منابع مشابه
The Maximum Degree of the Barabasi-Albert Random Tree
In the classical Erdős–Rényi model of random graphs, when the number of edges is proportional to the number of vertices, the degree distribution is approximately Poisson with a tail decreasing even faster than exponentially. However, in many real life networks power law degree distributions were observed with different exponents. To introduce a more realistic model for the evolution of random n...
متن کاملOn the Maximum Degree of a Random Planar Graph
Let the random graph Rn be drawn uniformly at random from the set of all simple planar graphs on n labelled vertices. We see that with high probability the maximum degree of Rn is Θ(lnn). We consider also the maximum size of a face and the maximum increase in the number of components on deleting a vertex. These results extend to graphs embeddable on any fixed surface.
متن کاملOn the maximum out-degree in random trees
00 1 + L: If some mild conditions are satisfied, then Y n "'-' c( cp( T ) / T t . n -3 /2 1 where TCP' (T) cp( T). We say that a node v in a rooted tree has out-degree k if v is incident with k edges that lead away from the root of Tn. Our object here is to the behaviour of the maximum ~ ~(Tn) of trees in F. After describing briefly in §2 the ;:"'A~vL .u,,,,,-,ufamilies of trees we shall be con...
متن کاملLimit distribution for the maximum degree of a random recursive tree
If a recursive tree is selected uniformly at random from among all recursive trees on n vertices, then the distribution of the maximum in-degree is given asymptotically by the following theorem: for any 3xed integer d, Pn( 6 n + d)= exp(−2{ n}−d−1) + o(1) as n → ∞; where n = log2 n. (As usual, n denotes the greatest integer less than or equal to n, and { n}= n− n :) The proof makes extensive us...
متن کاملThe maximum degree of random planar graphs
McDiarmid and Reed [‘On the maximum degree of a random planar graph’, Combin. Probab. Comput. 17 (2008) 591–601] showed that the maximum degree Δn of a random labeled planar graph with n vertices satisfies with high probability (w.h.p.) c1 logn < Δn < c2 logn, for suitable constants 0 < c1 < c2. In this paper, we determine the precise asymptotics, showing in particular that w.h.p. |Δn − c logn|...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Michigan Mathematical Journal
سال: 1968
ISSN: 0026-2285
DOI: 10.1307/mmj/1029000098